Properties of syntax directed translations

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited

Quasi-alphabetic tree bimorphisms [Steinby and Tîrn uc : Syntax-Directed Translations and Quasi-Alphabetic Tree Bimorphisms. Proc. CIAA, LNCS 4783:265 276, 2007] are reconsidered. It is known that the class of (string) translations de ned by such bimorphisms coincides with the class of syntax-directed translations. This result is extended to a smaller class of tree bimorphisms namely (linear an...

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms

Dispersion properties of ergodic translations

If the rotation angle α is irrational, then ζ is generating for T (see [4]) and the partition ζn = ζ ∨Tζ ∨···∨Tn−1ζ is made out of 2n arcs. This can be easily realized by induction: when passing from ζn−1 to ζn one has to add to the endpoints of the arcs belonging to ζn−1 the two new points Tn(0) and Tn(1/2) (for rational α, say α = p/q, the partition ζn has precisely 2q arcs for all n≥ q). Thu...

Syntax-directed Transformations of XML Streams

We discuss the TransformX framework for syntax-directed transformations of XML streams. In this framework, we define stream transformations as a special form of attributed extended regular tree grammars where all attributes can be evaluated in a single pass over the input, a necessity in stream processing. In the tradition of tools such as Yacc, the TransformX parser generator translates attrib...

Properties of Translations for Logic Programs

We present a study of some properties of program translations in the context of logic programming. In particular we provide, under the answer set semantics, a translation for arbitrary propositional theories into the simple class of disjunctive programs. We also show how syntactic and semantic properties of translations can be related. The work follows a line of research that applies mathematic...